The Program Compaction Revisited: the Functional Framework

This paper presents a general method to compact the rst-order part of functional languages with call-by-value semantics for ne-grain parallel machines like VLIW or super-scalars. This work extends previous works on compaction in two ways. First, it deenes a new formal system for the compaction problem usable to design a meta-compiler for these machines. Second, the compaction is directly applied to functional expressions instead of graph based representations (control ow or dependence ow based representations) leading to a very uniform and simple presentation.